Deciding the Inductive Validity of ∀ ∃ * Queries
Identifieur interne : 003969 ( Main/Exploration ); précédent : 003968; suivant : 003970Deciding the Inductive Validity of ∀ ∃ * Queries
Auteurs : Matthias Horbach [Allemagne] ; Christoph Weidenbach [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present a new saturation-based decidability result for inductive validity. Let $\it \Sigma$ be a finite signature in which all function symbols are at most unary and let N be a satisfiable Horn clause set without equality in which all positive literals are linear. If N ∪ {A 1,...,A n →} belongs to a class that can be finitely saturated by ordered resolution modulo variants, then it is decidable whether a sentence of the form $\forall x.\exists\vec y.A_1\wedge\ldots\wedge A_n$ is valid in the minimal model of N.
Url:
DOI: 10.1007/978-3-642-04027-6_25
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000515
- to stream Istex, to step Curation: 000511
- to stream Istex, to step Checkpoint: 000A76
- to stream Main, to step Merge: 003A47
- to stream Main, to step Curation: 003969
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Deciding the Inductive Validity of ∀ ∃ * Queries</title><author><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name></author><author><name sortKey="Weidenbach, Christoph" sort="Weidenbach, Christoph" uniqKey="Weidenbach C" first="Christoph" last="Weidenbach">Christoph Weidenbach</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:1726ADA7E65BE676C86BB724373DE5C45FEB8235</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-04027-6_25</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-P3800X1B-3/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000515</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000515</idno><idno type="wicri:Area/Istex/Curation">000511</idno><idno type="wicri:Area/Istex/Checkpoint">000A76</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A76</idno><idno type="wicri:doubleKey">0302-9743:2009:Horbach M:deciding:the:inductive</idno><idno type="wicri:Area/Main/Merge">003A47</idno><idno type="wicri:Area/Main/Curation">003969</idno><idno type="wicri:Area/Main/Exploration">003969</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Deciding the Inductive Validity of ∀ ∃ <hi rend="superscript">*</hi> Queries</title><author><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max Planck Institute for Informatics, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Weidenbach, Christoph" sort="Weidenbach, Christoph" uniqKey="Weidenbach C" first="Christoph" last="Weidenbach">Christoph Weidenbach</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max Planck Institute for Informatics, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present a new saturation-based decidability result for inductive validity. Let $\it \Sigma$ be a finite signature in which all function symbols are at most unary and let N be a satisfiable Horn clause set without equality in which all positive literals are linear. If N ∪ {A 1,...,A n →} belongs to a class that can be finitely saturated by ordered resolution modulo variants, then it is decidable whether a sentence of the form $\forall x.\exists\vec y.A_1\wedge\ldots\wedge A_n$ is valid in the minimal model of N.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name></region><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name><name sortKey="Weidenbach, Christoph" sort="Weidenbach, Christoph" uniqKey="Weidenbach C" first="Christoph" last="Weidenbach">Christoph Weidenbach</name><name sortKey="Weidenbach, Christoph" sort="Weidenbach, Christoph" uniqKey="Weidenbach C" first="Christoph" last="Weidenbach">Christoph Weidenbach</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003969 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003969 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:1726ADA7E65BE676C86BB724373DE5C45FEB8235
|texte= Deciding the Inductive Validity of ∀ ∃ * Queries
}}
| This area was generated with Dilib version V0.6.33. |  |